import java.util.Arrays;
import java.util.Scanner;

/**
 * @author : niu niu
 * @version : 1.0.0
 * @date : 2022/10/11 22:20
 * 排序子序列
 * 字符串逆序
 */
public class Day2{
    public static void main1(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        //Array
        int[] array = new int[n+1];
        for (int i = 0; i < array.length-1; i++) {
            array[i]=scanner.nextInt();
        }

        //Algo
        int count = 0;
        int i = 1;
        while(i<n) {
            if(array[i-1]==array[i]){
                i++;
            }else if(array[i-1] > array[i]){
                //判断是否是连减
                while ((i<array.length )&& array[i-1] >= array[i]){
                    i++;
                }
                count++;
                i++;
            }else if( array[i-1] < array[i]){
                //判断是否是连增
                while ((i<array.length ) &&  array[i-1] <= array[i]){
                    i++;
                }
                count++;
                i++;
            }
        }
        System.out.println(count);
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String str = scanner.nextLine();
        String[] strings = str.split(" ");
        StringBuilder sb = new StringBuilder();
        for (int i = strings.length-1; i >=0; i--) {
            sb.append(strings[i]);
            if(i!=0){
                sb.append(" ");
            }
        }
        System.out.println(sb.toString());
    }
}

